Pareto-optimal Nash equilibrium in capacity allocation game for self-managed networks
نویسندگان
چکیده
In this paper we introduce a capacity allocation game which models the problem of maximizing network utility from the perspective of distributed noncooperative agents. Motivated by the idea of self-managed networks, in the developed framework decision-making entities are associated with individual transmission links, deciding on the way they split capacity among concurrent flows. An efficient decentralized algorithm is given for computing strongly Pareto-optimal strategies, constituting a pure Nash equilibrium. Subsequently, we discuss the properties of the introduced game related to the Price of Anarchy and Price of Stability. The paper is concluded with an experimental study.
منابع مشابه
Distributed Algorithms for Fair Bandwidth Allocation to Elastic Services in Broadband Networks
The Nash arbitration scheme from cooperative game theory provides a natural framework to address the allocation of available bandwidth in network links which is network (Pareto) optimal and satisfies precise notions of fairness. In this paper we propose two distributed bandwidth allocation schemes that allocate available badwidths to elastic sources according to the Nash arbitration scheme. We ...
متن کاملSelf-Coexistence among IEEE 802.22 Networks: Distributed Allocation of Power and Channel
Ensuring self-coexistence among IEEE 802.22 networks is a challenging problem owing to opportunistic access of incumbent-free radio resources by users in co-located networks. In this study, we propose a fully-distributed non-cooperative approach to ensure self-coexistence in downlink channels of IEEE 802.22 networks. We formulate the self-coexistence problem as a mixed-integer non-linear optimi...
متن کاملLearning Equilibrium of a Stochastic Game on Gaussian Interference Channels with Incomplete Information
We consider a wireless communication system in which N transmitter-receiver pairs want to communicate with each other. Each transmitter transmits data at a certain rate using a power that depends on the channel gain to its receiver. If a receiver can successfully receive the message, it sends an acknowledgement (ACK), else it sends a negative ACK (NACK). Each user aims to maximize its probabili...
متن کاملBroadcast Channel Games: Equilibrium Characterization and a MIMO MAC-BC Game Duality
The emergence of heterogeneous decentralized networks without a central controller, such as device-to-device communication systems, has created the need for new problem frameworks to design and analyze the performance of such networks. As a key step towards such an analysis for general networks, this paper examines the strategic behavior of receivers in a Gaussian broadcast channel (BC) and tra...
متن کاملChannel-relay price pair: towards arbitrating incentives in wireless ad hoc networks
Cooperation in wireless ad hoc networks has two-fold implications. First, each wireless node does not excessively and greedily inject traffic to the shared wireless channel. Second, intermediate nodes voluntarily relay traffic for upstream nodes towards the destination at the cost of its own private resource. Such an assumption supports almost all existing research when it comes to protocol des...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Networks
دوره 57 شماره
صفحات -
تاریخ انتشار 2013